/*
 * Copyright (c) 2003, Karlsruhe University
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */
/*
 * Copyright (c) 2007 Open Kernel Labs, Inc. (Copyright Holder).
 * All rights reserved.
 *
 * 1. Redistribution and use of OKL4 (Software) in source and binary
 * forms, with or without modification, are permitted provided that the
 * following conditions are met:
 *
 *     (a) Redistributions of source code must retain this clause 1
 *         (including paragraphs (a), (b) and (c)), clause 2 and clause 3
 *         (Licence Terms) and the above copyright notice.
 *
 *     (b) Redistributions in binary form must reproduce the above
 *         copyright notice and the Licence Terms in the documentation and/or
 *         other materials provided with the distribution.
 *
 *     (c) Redistributions in any form must be accompanied by information on
 *         how to obtain complete source code for:
 *        (i) the Software; and
 *        (ii) all accompanying software that uses (or is intended to
 *        use) the Software whether directly or indirectly.  Such source
 *        code must:
 *        (iii) either be included in the distribution or be available
 *        for no more than the cost of distribution plus a nominal fee;
 *        and
 *        (iv) be licensed by each relevant holder of copyright under
 *        either the Licence Terms (with an appropriate copyright notice)
 *        or the terms of a licence which is approved by the Open Source
 *        Initative.  For an executable file, "complete source code"
 *        means the source code for all modules it contains and includes
 *        associated build and other files reasonably required to produce
 *        the executable.
 *
 * 2. THIS SOFTWARE IS PROVIDED ``AS IS'' AND, TO THE EXTENT PERMITTED BY
 * LAW, ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
 * PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED.  WHERE ANY WARRANTY IS
 * IMPLIED AND IS PREVENTED BY LAW FROM BEING DISCLAIMED THEN TO THE
 * EXTENT PERMISSIBLE BY LAW: (A) THE WARRANTY IS READ DOWN IN FAVOUR OF
 * THE COPYRIGHT HOLDER (AND, IN THE CASE OF A PARTICIPANT, THAT
 * PARTICIPANT) AND (B) ANY LIMITATIONS PERMITTED BY LAW (INCLUDING AS TO
 * THE EXTENT OF THE WARRANTY AND THE REMEDIES AVAILABLE IN THE EVENT OF
 * BREACH) ARE DEEMED PART OF THIS LICENCE IN A FORM MOST FAVOURABLE TO
 * THE COPYRIGHT HOLDER (AND, IN THE CASE OF A PARTICIPANT, THAT
 * PARTICIPANT). IN THE LICENCE TERMS, "PARTICIPANT" INCLUDES EVERY
 * PERSON WHO HAS CONTRIBUTED TO THE SOFTWARE OR WHO HAS BEEN INVOLVED IN
 * THE DISTRIBUTION OR DISSEMINATION OF THE SOFTWARE.
 *
 * 3. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR ANY OTHER PARTICIPANT BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
 * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
/*
 * Description:   Management of small spaces from kernel debugger
 */
#include <debug.h>
#include <kdb/kdb.h>
#include <kdb/cmd.h>
#include <kdb/input.h>

#include INC_GLUE(space.h)


extern space_t * small_space_owner[SMALLSPACE_AREA_SIZE >> IA32_PAGEDIR_BITS];


DECLARE_CMD_GROUP (ia32_smallspaces);

/**
 * Small address spaces managment.
 */
DECLARE_CMD (cmd_smallspaces, arch, 's', "smallspaces",
             "Manage small addesss spaces");

CMD (cmd_smallspaces, cg)
{
    return ia32_smallspaces.interact (cg, "smallspaces");
}


/**
 * Dump small address spaces.
 */
DECLARE_CMD (cmd_smallspaces_dump, ia32_smallspaces, 'd', "dump",
             "Dump small spaces");

CMD (cmd_smallspaces_dump, cg)
{
    const word_t max_idx = SMALLSPACE_AREA_SIZE >> IA32_PAGEDIR_BITS;

    printf ("Small address space allocation:\n");

    word_t b = 0, i;
    for (i = 1; i < max_idx; i++)
    {
        if (small_space_owner[b] != small_space_owner[i])
        {
            printf (small_space_owner[b] ?
                    "%5d-%d MB\t<%p-%p>  space: %p\n" :
                    "%5d-%d MB\t<%p-%p>  (free)\n",
                    b*4, i*4,
                    SMALLSPACE_AREA_START + (b * IA32_PAGEDIR_SIZE),
                    SMALLSPACE_AREA_START + (i * IA32_PAGEDIR_SIZE),
                    small_space_owner[b]);
            b = i;
        }
    }
    printf (small_space_owner[b] ?
            "%5d-%d MB\t<%p-%p>  space: %p\n" :
            "%5d-%d MB\t<%p-%p>  (free)\n",
            b*4, i*4,
            SMALLSPACE_AREA_START + (b * IA32_PAGEDIR_SIZE),
            SMALLSPACE_AREA_START + (i * IA32_PAGEDIR_SIZE),
            small_space_owner[b]);

    return CMD_NOQUIT;
}


/**
 * Turn address space into small space.
 */
DECLARE_CMD (cmd_smallspaces_mksmall, ia32_smallspaces, 's', "mksmall",
             "Make space small");

CMD (cmd_smallspaces_mksmall, cg)
{
    space_t * space = get_space ("Space");
    space = space ? space : get_kernel_space();

    smallspace_id_t id;
    word_t size, idx;

    for (;;)
    {
        if ((size = get_dec ("Size (in MB)", 16)) == ABORT_MAGIC)
            return CMD_NOQUIT;

        if ((idx = get_dec ("Index", 0)) == ABORT_MAGIC)
            return CMD_NOQUIT;

        idx *= size;

        if (((idx + size) >> 2) * IA32_PAGEDIR_SIZE <= SMALLSPACE_AREA_SIZE)
            break;

        printf ("Invalid parameters.\n");
    }

    id.set_small (idx, size);

    if (! space->make_small (id))
        printf ("Unable to create small space!\n");

    return CMD_NOQUIT;
}


/**
 * Turn address space into large space.
 */
DECLARE_CMD (cmd_smallspaces_mklarge, ia32_smallspaces, 'l', "mklarge",
             "Make space large");

CMD (cmd_smallspaces_mklarge, cg)
{
    space_t * space = get_space ("Space");
    space = space ? space : get_kernel_space();
    space->make_large ();
    return CMD_NOQUIT;
}

